#include <iostream>
#include <vector>
#include <algorithm>
#include <stack>
#include <math.h>
using namespace std;
/*
解决区间调度问题的贪心算法
*/

void greedy_for_is(int A[9][2], int val[], int n){
    



}
int main(){
    int activities[9][2] = {
        {0,2},
        {0,5},
        {4,8},
        {7,9},
        {11,13},
        {0,14},
        {12,15},
        {18,19},
        {17,20}
    };
    //已经将活动按照结束的时间升序排序
    int val[9] = {1, 5, 4, 2, 3, 2, 1, 3, 5};
    greedy_for_is(activities, val, 9);
    return 0;
}